ON ASYMPTOTICALLY OPTIMAL ALGORITHMS FOR PATTERN CLASSIFICATION PROBLEMS
نویسندگان
چکیده
منابع مشابه
Parallelizing asymptotically optimal algorithms for large-scale dualization problems
Dualization is a key discrete enumeration problem. It is not known whether or not this problem is polynomial-time solvable. Asymptotically optimal dualization algorithms are the fastest among the known dualization algorithms, which is supported by new experiments with various data described in this paper. A theoretical justification of the efficiency of these algorithms on the average was given...
متن کاملModels and Asymptotically Optimal Algorithms for Pickup and Delivery Problems on Roadmaps
One of the most common combinatorial problems in logistics and transportation applications is the Stacker Crane problem (SCP), where commodities or customers are associated with a pickup location and a delivery location, and the objective is to find a minimum-length tour visiting all locations with the constraint that each pickup location and its associated delivery location are visited in cons...
متن کاملAsymptotically Optimal Algorithms for Pickup and Delivery Problems with Application to Large-Scale Transportation Systems
Pickup and delivery problems (PDPs), in which objects or people have to be transported between specific locations, are among the most common combinatorial problems in real-world operations. A widely-encountered type of PDP is the Stacker Crane Problem (SCP), where each commodity/customer is associated with a pickup location and a delivery location, and the objective is to find a minimum-length ...
متن کاملAsymptotically Optimal Algorithms for Multiple Play Bandits with Partial Feedback
We study a variant of the multi-armed bandit problem with multiple plays in which the user wishes to sample the m out of k arms with the highest expected rewards, but at any given time can only sample ` ≤ m arms. When ` = m, Thompson sampling was recently shown to be asymptotically efficient. We derive an asymptotic regret lower bound for any uniformly efficient algorithm in our new setting whe...
متن کاملAsymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
We propose asymptotically optimal algorithms for the job shop scheduling and packet routing problems. We propose a fluid relaxation for the job shop scheduling problem in which we replace discrete jobs with the flow of a continuous fluid. We compute an optimal solution of the fluid relaxation in closed form, obtain a lower bound C,,, to the job shop scheduling problem, and construct a feasible ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Mathematical Statistics
سال: 1973
ISSN: 0007-4993
DOI: 10.5109/13070